A Behavioural Theory for a π-calculus with Preorders
نویسندگان
چکیده
We study the behavioural theory of πP, a π-calculus featuring restriction as the only binder. In contrast with calculi such as Fusions and Chi, reduction in πP generates a preorder on names rather than an equivalence relation. We present two characterisations of barbed congruence in πP: the first is based on a compositional LTS, and the second is an axiomatisation. The results in this paper bring out basic properties of πP, mostly related to the interplay between the restriction operator and the preorder on names.
منابع مشابه
Choreographies and Behavioural Contracts on the Way to Dynamic Updates
We survey our work on choreographies and behavioural contracts in multiparty interactions. In particular theories of behavioural contracts are presented which enable reasoning about correct service composition (contract compliance) and service substitutability (contract refinement preorder) under different assumptions concerning service communication: synchronous address or name based communica...
متن کاملCharacterisations of Testing Preorders for a Finite Probabilistic pi-Calculus
We consider two characterisations of the may and must testing preorders for a probabilistic extension of the finite π-calculus: one based on notions of probabilistic weak simulations, and the other on a probabilistic extension of a fragment of Milner-Parrow-Walker modal logic for the π-calculus. We base our notions of simulations on the similar concepts used in previous work for probabilistic C...
متن کاملCharacterising Testing Preorders for Broadcasting Distributed Systems
We present a process calculus for both specifying the desired behaviour of distributed systems and for describing their actual implementation; the calculus is aimed at the internet layer of the TCP/IP reference model. This allows us to define behavioural preorders in the style of DeNicola and Hennessy, relating specifications and implementations for distributed systems at this level of abstract...
متن کاملModel Independent Order Relations for Processes
Semantic preorders between processes are usually applied in practice to model approximation or implementation relationships. For interactive models these preorders depend crucially on the observational behaviours of processes as well as on the observing power of environments. The paper aims at a model independent observational theory of the semantic preorders for interactive models. Depending o...
متن کاملCompleteness and Logical Full Abstraction in Modal Logics for Typed Mobile Processes
We study an extension of Hennessy-Milner logic for the π-calculus which gives a sound and complete characterisation of representative behavioural preorders and equivalences over typed processes. New connectives are introduced representing actual and hypothetical typed parallel composition and hiding. We study three compositional proof systems, characterising the May/Must testing preorders and b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Log. Algebr. Meth. Program.
دوره 84 شماره
صفحات -
تاریخ انتشار 2015